package com.yuqian.JavaSe.leetcode.easy;

/**
 * Given a sorted linked list, delete all duplicates such that each element
 * appear only once. For example, Given 1->1->2, return 1->2. Given
 * 1->1->2->3->3, return 1->2->3.
 * 
 * @author yuqian
 *
 */
public class RemoveDuplicatesfromSortedList {
	public ListNode deleteDuplicates(ListNode head) {
        ListNode list = head;
        
        while(list != null) {
       	 if (list.next == null) {
       		 break;
       	 }
       	 if (list.val == list.next.val) {
       		 list.next = list.next.next;
       	 } else {
       		 list = list.next;
       	 }
        }
        
        return head;
	}
}
